Monotone pseudobase assignments and Lindelöf Σ-property

نویسندگان

چکیده

برای دانلود باید عضویت طلایی داشته باشید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Lindelöf Σ-Spaces and R-Factorizable Paratopological Groups

We prove that if a paratopological group G is a continuous image of an arbitrary product of regular Lindelöf Σ-spaces, then it is R-factorizable and has countable cellularity. If in addition, G is regular, then it is totally ω-narrow and satisfies celω(G) ≤ ω, and the Hewitt–Nachbin completion of G is again an R-factorizable paratopological group.

متن کامل

Property of σ(600) and Chiral Symmetry

The chiral symmetry and the notion of its dynamical breaking have been playing a central role in understanding the spectroscopy of hadrons with light-quarks. Presently the non-linear representation (Non-Linear σ Model(NLσM)) of chiral SU(2)L×SU(2)R group is widely accepted to be realized in nature on the basis of the success of low energy theorems concerning π mesons as Nambu-Goldstone bosons. ...

متن کامل

More on rc-Lindelöf sets and almost rc-Lindelöf sets

A subset A of a space X is called regular open if A = IntA, and regular closed if X\A is regular open, or equivalently, if A= IntA. A is called semiopen [16] (resp., preopen [17], semi-preopen [3], b-open [4]) ifA⊂ IntA (resp.,A⊂ IntA,A⊂ IntA ,A⊂ IntA∪ IntA). The concept of a preopen set was introduced in [6] where the term locally dense was used and the concept of a semi-preopen set was introd...

متن کامل

A Concrete Procedure of the Σ-protocol on Monotone Predicates

We propose a concrete procedure of the Σ-protocol proposed by Cramer, Damg̊ard and Schoenmakers at CRYPTO ’94, which is for proving knowledge that a set of witnesses satisfies a monotone predicate in witness-indistinguishable way. We provide the concrete procedure by extending the so-called OR-proof.

متن کامل

A Concrete Procedure of Σ-protocol on Monotone Predicate

We propose a concrete procedure of a Σ-protocol proving knowledge that a set of witnesses satisfies a monotone predicate in the witness-indistinguishable manner. Inspired by the high-level work proposed by Cramer, Damg̊ard and Schoenmakers at CRYPTO ’94, we provide a concrete procedure by extending the so-called OR-proof.

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

ژورنال

عنوان ژورنال: Topology and its Applications

سال: 2016

ISSN: 0166-8641

DOI: 10.1016/j.topol.2016.06.019